TSTP Solution File: ITP256^1 by E---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1.00
% Problem  : ITP256^1 : TPTP v8.2.0. Released v8.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n020.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Mon May 20 22:17:36 EDT 2024

% Result   : Theorem 82.26s 22.14s
% Output   : CNFRefutation 82.26s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :   20
% Syntax   : Number of formulae    :   29 (   6 unt;  16 typ;   0 def)
%            Number of atoms       :   33 (   3 equ;   0 cnn)
%            Maximal formula atoms :   12 (   2 avg)
%            Number of connectives :  140 (  15   ~;  12   |;   5   &; 105   @)
%                                         (   1 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   14 (   7 avg)
%            Number of types       :    5 (   4 usr)
%            Number of type conns  :   16 (  16   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   14 (  12 usr;   4 con; 0-2 aty)
%            Number of variables   :   14 (   0   ^  14   !;   0   ?;  14   :)

% Comments : 
%------------------------------------------------------------------------------
thf(decl_sort1,type,
    nat: $tType ).

thf(decl_sort2,type,
    vEBT_VEBT: $tType ).

thf(decl_sort3,type,
    set_VEBT_VEBT: $tType ).

thf(decl_sort4,type,
    list_VEBT_VEBT: $tType ).

thf(decl_511,type,
    set_VEBT_VEBT2: list_VEBT_VEBT > set_VEBT_VEBT ).

thf(decl_557,type,
    nth_VEBT_VEBT: list_VEBT_VEBT > nat > vEBT_VEBT ).

thf(decl_648,type,
    size_s6755466524823107622T_VEBT: list_VEBT_VEBT > nat ).

thf(decl_746,type,
    ord_less_nat: nat > nat > $o ).

thf(decl_1117,type,
    vEBT_V8194947554948674370ptions: vEBT_VEBT > nat > $o ).

thf(decl_1118,type,
    vEBT_VEBT_high: nat > nat > nat ).

thf(decl_1127,type,
    vEBT_invar_vebt: vEBT_VEBT > nat > $o ).

thf(decl_1131,type,
    vEBT_vebt_delete: vEBT_VEBT > nat > vEBT_VEBT ).

thf(decl_1221,type,
    member_VEBT_VEBT: vEBT_VEBT > set_VEBT_VEBT > $o ).

thf(decl_1227,type,
    na: nat ).

thf(decl_1229,type,
    treeList: list_VEBT_VEBT ).

thf(decl_1230,type,
    xa: nat ).

thf(fact_23__C4_OIH_C_I1_J,axiom,
    ! [X11: vEBT_VEBT] :
      ( ( member_VEBT_VEBT @ X11 @ ( set_VEBT_VEBT2 @ treeList ) )
     => ( ( vEBT_invar_vebt @ X11 @ na )
        & ! [X13: nat,X14: nat] :
            ( ( vEBT_V8194947554948674370ptions @ ( vEBT_vebt_delete @ X11 @ X13 ) @ X14 )
          <=> ( ( X13 != X14 )
              & ( vEBT_V8194947554948674370ptions @ X11 @ X14 ) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_23__C4_OIH_C_I1_J) ).

thf(fact_137_nth__mem,axiom,
    ! [X7: nat,X19: list_VEBT_VEBT] :
      ( ( ord_less_nat @ X7 @ ( size_s6755466524823107622T_VEBT @ X19 ) )
     => ( member_VEBT_VEBT @ ( nth_VEBT_VEBT @ X19 @ X7 ) @ ( set_VEBT_VEBT2 @ X19 ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_137_nth__mem) ).

thf(conj_0,conjecture,
    vEBT_invar_vebt @ ( nth_VEBT_VEBT @ treeList @ ( vEBT_VEBT_high @ xa @ na ) ) @ na,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).

thf(fact_8__092_060open_062high_Ax_An_A_060_Alength_AtreeList_092_060close_062,axiom,
    ord_less_nat @ ( vEBT_VEBT_high @ xa @ na ) @ ( size_s6755466524823107622T_VEBT @ treeList ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_8__092_060open_062high_Ax_An_A_060_Alength_AtreeList_092_060close_062) ).

thf(c_0_4,plain,
    ! [X23239: vEBT_VEBT,X23240: nat,X23241: nat] :
      ( ( ( vEBT_invar_vebt @ X23239 @ na )
        | ~ ( member_VEBT_VEBT @ X23239 @ ( set_VEBT_VEBT2 @ treeList ) ) )
      & ( ( X23240 != X23241 )
        | ~ ( vEBT_V8194947554948674370ptions @ ( vEBT_vebt_delete @ X23239 @ X23240 ) @ X23241 )
        | ~ ( member_VEBT_VEBT @ X23239 @ ( set_VEBT_VEBT2 @ treeList ) ) )
      & ( ( vEBT_V8194947554948674370ptions @ X23239 @ X23241 )
        | ~ ( vEBT_V8194947554948674370ptions @ ( vEBT_vebt_delete @ X23239 @ X23240 ) @ X23241 )
        | ~ ( member_VEBT_VEBT @ X23239 @ ( set_VEBT_VEBT2 @ treeList ) ) )
      & ( ( X23240 = X23241 )
        | ~ ( vEBT_V8194947554948674370ptions @ X23239 @ X23241 )
        | ( vEBT_V8194947554948674370ptions @ ( vEBT_vebt_delete @ X23239 @ X23240 ) @ X23241 )
        | ~ ( member_VEBT_VEBT @ X23239 @ ( set_VEBT_VEBT2 @ treeList ) ) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_23__C4_OIH_C_I1_J])])])]) ).

thf(c_0_5,plain,
    ! [X24193: nat,X24194: list_VEBT_VEBT] :
      ( ~ ( ord_less_nat @ X24193 @ ( size_s6755466524823107622T_VEBT @ X24194 ) )
      | ( member_VEBT_VEBT @ ( nth_VEBT_VEBT @ X24194 @ X24193 ) @ ( set_VEBT_VEBT2 @ X24194 ) ) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_137_nth__mem])]) ).

thf(c_0_6,negated_conjecture,
    ~ ( vEBT_invar_vebt @ ( nth_VEBT_VEBT @ treeList @ ( vEBT_VEBT_high @ xa @ na ) ) @ na ),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])]) ).

thf(c_0_7,plain,
    ! [X1: vEBT_VEBT] :
      ( ( vEBT_invar_vebt @ X1 @ na )
      | ~ ( member_VEBT_VEBT @ X1 @ ( set_VEBT_VEBT2 @ treeList ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

thf(c_0_8,plain,
    ! [X2: nat,X5: list_VEBT_VEBT] :
      ( ( member_VEBT_VEBT @ ( nth_VEBT_VEBT @ X5 @ X2 ) @ ( set_VEBT_VEBT2 @ X5 ) )
      | ~ ( ord_less_nat @ X2 @ ( size_s6755466524823107622T_VEBT @ X5 ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

thf(c_0_9,negated_conjecture,
    ~ ( vEBT_invar_vebt @ ( nth_VEBT_VEBT @ treeList @ ( vEBT_VEBT_high @ xa @ na ) ) @ na ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

thf(c_0_10,plain,
    ! [X2: nat] :
      ( ( vEBT_invar_vebt @ ( nth_VEBT_VEBT @ treeList @ X2 ) @ na )
      | ~ ( ord_less_nat @ X2 @ ( size_s6755466524823107622T_VEBT @ treeList ) ) ),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

thf(c_0_11,plain,
    ord_less_nat @ ( vEBT_VEBT_high @ xa @ na ) @ ( size_s6755466524823107622T_VEBT @ treeList ),
    inference(split_conjunct,[status(thm)],[fact_8__092_060open_062high_Ax_An_A_060_Alength_AtreeList_092_060close_062]) ).

thf(c_0_12,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.15  % Problem    : ITP256^1 : TPTP v8.2.0. Released v8.1.0.
% 0.09/0.17  % Command    : run_E %s %d THM
% 0.15/0.38  % Computer : n020.cluster.edu
% 0.15/0.38  % Model    : x86_64 x86_64
% 0.15/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.38  % Memory   : 8042.1875MB
% 0.15/0.38  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.38  % CPULimit   : 300
% 0.15/0.38  % WCLimit    : 300
% 0.15/0.38  % DateTime   : Sat May 18 16:27:53 EDT 2024
% 0.15/0.38  % CPUTime    : 
% 0.22/0.53  Running higher-order theorem proving
% 0.22/0.53  Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 82.26/22.14  # Version: 3.1.0-ho
% 82.26/22.14  # partial match(2): HMLMSMSMSSLCHFA
% 82.26/22.14  # Preprocessing class: HMLLSMLMSSLCHFA.
% 82.26/22.14  # Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 82.26/22.14  # Starting new_ho_10 with 1495s (5) cores
% 82.26/22.14  # Starting sh5l with 299s (1) cores
% 82.26/22.14  # Starting new_bool_1 with 299s (1) cores
% 82.26/22.14  # Starting new_bool_2 with 299s (1) cores
% 82.26/22.14  # new_bool_2 with pid 6489 completed with status 0
% 82.26/22.14  # Result found by new_bool_2
% 82.26/22.14  # partial match(2): HMLMSMSMSSLCHFA
% 82.26/22.14  # Preprocessing class: HMLLSMLMSSLCHFA.
% 82.26/22.14  # Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 82.26/22.14  # Starting new_ho_10 with 1495s (5) cores
% 82.26/22.14  # Starting sh5l with 299s (1) cores
% 82.26/22.14  # Starting new_bool_1 with 299s (1) cores
% 82.26/22.14  # Starting new_bool_2 with 299s (1) cores
% 82.26/22.14  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 82.26/22.14  # Search class: HGHSM-SMLM32-DHFFFSBN
% 82.26/22.14  # Scheduled 5 strats onto 1 cores with 299 seconds (299 total)
% 82.26/22.14  # Starting new_ho_10 with 180s (1) cores
% 82.26/22.14  # new_ho_10 with pid 6490 completed with status 0
% 82.26/22.14  # Result found by new_ho_10
% 82.26/22.14  # partial match(2): HMLMSMSMSSLCHFA
% 82.26/22.14  # Preprocessing class: HMLLSMLMSSLCHFA.
% 82.26/22.14  # Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 82.26/22.14  # Starting new_ho_10 with 1495s (5) cores
% 82.26/22.14  # Starting sh5l with 299s (1) cores
% 82.26/22.14  # Starting new_bool_1 with 299s (1) cores
% 82.26/22.14  # Starting new_bool_2 with 299s (1) cores
% 82.26/22.14  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 82.26/22.14  # Search class: HGHSM-SMLM32-DHFFFSBN
% 82.26/22.14  # Scheduled 5 strats onto 1 cores with 299 seconds (299 total)
% 82.26/22.14  # Starting new_ho_10 with 180s (1) cores
% 82.26/22.14  # Preprocessing time       : 0.148 s
% 82.26/22.14  # Presaturation interreduction done
% 82.26/22.14  
% 82.26/22.14  # Proof found!
% 82.26/22.14  # SZS status Theorem
% 82.26/22.14  # SZS output start CNFRefutation
% See solution above
% 82.26/22.14  # Parsed axioms                        : 10756
% 82.26/22.14  # Removed by relevancy pruning/SinE    : 9096
% 82.26/22.14  # Initial clauses                      : 5831
% 82.26/22.14  # Removed in clause preprocessing      : 1840
% 82.26/22.14  # Initial clauses in saturation        : 3991
% 82.26/22.14  # Processed clauses                    : 10192
% 82.26/22.14  # ...of these trivial                  : 195
% 82.26/22.14  # ...subsumed                          : 2613
% 82.26/22.14  # ...remaining for further processing  : 7384
% 82.26/22.14  # Other redundant clauses eliminated   : 4434
% 82.26/22.14  # Clauses deleted for lack of memory   : 0
% 82.26/22.14  # Backward-subsumed                    : 45
% 82.26/22.14  # Backward-rewritten                   : 67
% 82.26/22.14  # Generated clauses                    : 84817
% 82.26/22.14  # ...of the previous two non-redundant : 76075
% 82.26/22.14  # ...aggressively subsumed             : 0
% 82.26/22.14  # Contextual simplify-reflections      : 77
% 82.26/22.14  # Paramodulations                      : 79199
% 82.26/22.14  # Factorizations                       : 22
% 82.26/22.14  # NegExts                              : 0
% 82.26/22.14  # Equation resolutions                 : 4468
% 82.26/22.14  # Disequality decompositions           : 0
% 82.26/22.14  # Total rewrite steps                  : 35321
% 82.26/22.14  # ...of those cached                   : 32504
% 82.26/22.14  # Propositional unsat checks           : 0
% 82.26/22.14  #    Propositional check models        : 0
% 82.26/22.14  #    Propositional check unsatisfiable : 0
% 82.26/22.14  #    Propositional clauses             : 0
% 82.26/22.14  #    Propositional clauses after purity: 0
% 82.26/22.14  #    Propositional unsat core size     : 0
% 82.26/22.14  #    Propositional preprocessing time  : 0.000
% 82.26/22.14  #    Propositional encoding time       : 0.000
% 82.26/22.14  #    Propositional solver time         : 0.000
% 82.26/22.14  #    Success case prop preproc time    : 0.000
% 82.26/22.14  #    Success case prop encoding time   : 0.000
% 82.26/22.14  #    Success case prop solver time     : 0.000
% 82.26/22.14  # Current number of processed clauses  : 3734
% 82.26/22.14  #    Positive orientable unit clauses  : 432
% 82.26/22.14  #    Positive unorientable unit clauses: 6
% 82.26/22.14  #    Negative unit clauses             : 351
% 82.26/22.14  #    Non-unit-clauses                  : 2945
% 82.26/22.14  # Current number of unprocessed clauses: 72381
% 82.26/22.14  # ...number of literals in the above   : 388890
% 82.26/22.14  # Current number of archived formulas  : 0
% 82.26/22.14  # Current number of archived clauses   : 2930
% 82.26/22.14  # Clause-clause subsumption calls (NU) : 13308090
% 82.26/22.14  # Rec. Clause-clause subsumption calls : 796478
% 82.26/22.14  # Non-unit clause-clause subsumptions  : 1513
% 82.26/22.14  # Unit Clause-clause subsumption calls : 423990
% 82.26/22.14  # Rewrite failures with RHS unbound    : 0
% 82.26/22.14  # BW rewrite match attempts            : 374
% 82.26/22.14  # BW rewrite match successes           : 113
% 82.26/22.14  # Condensation attempts                : 10192
% 82.26/22.14  # Condensation successes               : 77
% 82.26/22.14  # Termbank termtop insertions          : 5015123
% 82.26/22.14  # Search garbage collected termcells   : 161359
% 82.26/22.14  
% 82.26/22.14  # -------------------------------------------------
% 82.26/22.14  # User time                : 19.945 s
% 82.26/22.14  # System time              : 0.190 s
% 82.26/22.14  # Total time               : 20.135 s
% 82.26/22.14  # Maximum resident set size: 37216 pages
% 82.26/22.14  
% 82.26/22.14  # -------------------------------------------------
% 82.26/22.14  # User time                : 21.251 s
% 82.26/22.14  # System time              : 0.221 s
% 82.26/22.14  # Total time               : 21.472 s
% 82.26/22.14  # Maximum resident set size: 26776 pages
% 82.26/22.14  % E---3.1 exiting
% 82.26/22.14  % E exiting
%------------------------------------------------------------------------------